A perspective on certain polynomial-time solvable classes of satisfiability
نویسندگان
چکیده
منابع مشابه
A perspective on certain polynomial-time solvable classes of satisfiability
The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we find that, in some sense, the matched formulas are more nume...
متن کاملUsing Program Schemes to Logically Capture Polynomial-time on Certain Classes of Structures
We continue the study of the expressive power of certain classes of program schemes on nite structures, in relation to more mainstream logics studied in nite model theory and to computational complexity. We show that there exists a program scheme, whose constructs are assignments and while-loops with quantiier-free tests and which has access to a stack, that can solve a P-complete problem, the ...
متن کاملPolynomial-Time formula classes
So far the only method we have to solve the propositional satisfiability problem is to use truth tables, which takes exponential time in the formula size in the worst case. In this lecture we show that for Horn formulas and 2-CNF formulas satisfiability can be decided in polynomial time, whereas for 3-CNF formulas satisfiability is as hard as the general case. We also show that if we replace di...
متن کاملA near-optimal polynomial time algorithm for learning in certain classes of stochastic games
We present a new algorithm for polynomial time learning of optimal behavior in single-controller stochastic games. This algorithm incorporates and integrates important recent results of Kearns and Singh 5] in reinforcement learning and of Monderer and Tennenholtz 7] in repeated games. In stochastic games, the agent must cope with the existence of an adversary whose actions can be arbitrary. In ...
متن کاملA polynomial time spectral decomposition test for certain classes of inverse M-matrices
The primary result in this paper is a set of O(n) time algorithms to determine whether a speci ed real, symmetric matrix is a member of any of several closely related classes: the MMA-matrices; the inverse MMA-matrices; the strictly positive, positive de nite matrices whose eigenvectors form a Soules basis; and the strictly ultrametric matrices. When the class membership question is answered in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00358-4